HPSG as a True Dependency Grammar On a More Lexical Treatment of Extractions
نویسنده
چکیده
In this paper, we show how HPSG, with some adjustments, can be seen as a particular implementation of a dependency grammar and we discuss the advantages of such a view and the resulting status of phrases. Our study focuses on extraction which is the cornerstone of the theory and one of the more problematic phenomena for our hypothesis, the interpretation of HPSG as a dependency grammar. Our analysis of whwords will be based on an idea of Tesnière treating them simultaneously as complementizers and pronouns.1
منابع مشابه
A formal theory of dependency syntax with non-lexical units
The paper describes a formal theory for the dependency approach to syntax. The formalism is able to deal with long-distance dependencies, involved in function sharing and extractions. The distinctive aspects of the approach are the use of non lexical categories and a GPSG-style treatment of long-distance dependencies. The formalism is applied to a number of coordination phenomena, that are well...
متن کاملCorpus-Oriented Development of Japanese HPSG Parsers
This paper reports the corpus-oriented development of a wide-coverage Japanese HPSG parser. We first created an HPSG treebank from the EDR corpus by using heuristic conversion rules, and then extracted lexical entries from the treebank. The grammar developed using this method attained wide coverage that could hardly be obtained by conventional manual development. We also trained a statistical p...
متن کاملTransition-Based Parsing for Deep Dependency Structures
Derivations under different grammar formalisms allow extraction of various dependency structures. Particularly, bilexical deep dependency structures beyond surface tree representation can be derived from linguistic analysis grounded by CCG, LFG, and HPSG. Traditionally, these dependency structures are obtained as a by-product of grammar-guided parsers. In this article, we study the alternative ...
متن کاملPolarized Unification Grammars
This paper proposes a generic mathematical formalism for the combination of various structures: strings, trees, dags, graphs and products of them. The polarization of the objects of the elementary structures controls the saturation of the final structure. This formalism is both elementary and powerful enough to strongly simulate many grammar formalisms, such as rewriting systems, dependency gra...
متن کاملTowards an Account of Extraposition in HPSG
This paper investigates the syntax of extraposition in the HPSG framework. We present English and German data (partly taken from corpora), and provide an analysis using a nonlocal dependency and lexical rules. The condition for binding the dependency is formulated relative to the antecedent of the extraposed phrase, which entails that no fixed site for extraposition exists. Our account allows t...
متن کامل